Permutation on the Mesh with Reconfigurable Bus: Algorithms and Practical Considerations
نویسندگان
چکیده
Permutation is a common problem in both computation and communication. We add the buses to the mesh-connected multiprocessors and introduce the tokens to control the buses. We propose to use the mesh with segmented reconngurable bus to increase performance of data routing. Segmented reconngurable bus can not only use the bus-token more eeciently than the traditional bus, but also reduce interconnection delay. We choose the segment length to balance la-tency and throughput of the system to get better performance. In the simulation, the mesh with segmented reconngurable bus can nish N N permutation in :6065N steps in average.
منابع مشابه
Permutation Routing on Mesh model Parallel Computers
This paper studies the problems of permutation routing on different mesh models of parallel computation and simulates algorithms for different mesh models using C. Simple algorithms for permutation routing mesh models with and without bus have been considered, analyzed and simulated. In mesh models with bus, models with fixed bus and reconfigurable buses are dealt. For problems in permutation r...
متن کاملAn Algorithm Visualization Tool on the Reconfigurable Mesh
Many parallel algorithms on the reconfigurable mesh have been developed so far. However, it is hard to understand the behavior of these parallel algorithms, mainly because the bus topology dynamically changes during the execution of an algorithm. In this work, we present the visual mesh system (VMesh ), a tool for visualizing algorithms on the reconfigurable mesh. The main objective of the VMes...
متن کاملConstant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time solutions to the following computational geometry problems on the reconfigurable mesh: all-pairs ne...
متن کاملA Java Applet to Visualize Algorithms on Reconfigurable Mesh
Recently, many e cient parallel algorithms on the recon gurable mesh have been developed. However, it is not easy to understand the behavior of a recon gurable mesh. This is mainly because the bus topology can change dynamically during the execution of algorithm. In this work, we have developed JRM, a Java applet for visualizing parallel algorithm on the recon gurable mesh to help on understand...
متن کاملConstant Time Sorting on a Processor Array with a Reconfigurable Bus System
Sorting is undoubtedly one of the most fundamental problems in computer science. Many sequential sorting algorithms are available in the literatures [6] and it is well known that this problem requires O(n log n) time in the worst case. To speed-up sorting, many parallel algorithms have been proposed on various parallel machines [2]. Constant time sorting can be achieved on an extremely powerful...
متن کامل